Parallel architecture to accelerate superparamagnetic clustering algorithm
نویسندگان
چکیده
منابع مشابه
To Enhance A-KNN Clustering Algorithm for Improving Software Architecture
Software Architecture is important factor for the development of complex and big software system. Software Architecture Decomposition is an important part in software design. Software clustering is used to cluster functions of similar type in one cluster and other are in other cluster. Kmean is the base of the clustering but it has some limitations. Many clustering methods are used for decompos...
متن کاملA Multi-Objective Approach to Fuzzy Clustering using ITLBO Algorithm
Data clustering is one of the most important areas of research in data mining and knowledge discovery. Recent research in this area has shown that the best clustering results can be achieved using multi-objective methods. In other words, assuming more than one criterion as objective functions for clustering data can measurably increase the quality of clustering. In this study, a model with two ...
متن کاملA Parallel Genetic Algorithm for Clustering
Parallelization of genetic algorithms (GAs) has received considerable attention in recent years. The reason for this is the availability of suitable computational resources and the need for solving harder problems in reasonable time. We describe a new parallel self-adaptive GA for solving the data clustering problem. The algorithm utilizes island parallelization implemented using genebank model...
متن کاملParallel Algorithm for Extended Star Clustering
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of documents on distributed memory multiprocessors. The algorithm exploits the inherent data-parallelism in the extended star clustering algorithm. We implemented our algorithm on a cluster of personal computers connected ...
متن کاملParallel K-means Clustering Algorithm on NOWs
Despite its simplicity and its linear time, a serial K-means algorithm's time complexity remains expensive when it is applied to a problem of large size of multidimensional vectors. In this paper we show an improvement by a factor of O(K/2), where K is the number of desired clusters, by applying theories of parallel computing to the algorithm. In addition to time improvement, the parallel versi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2020
ISSN: 0013-5194,1350-911X
DOI: 10.1049/el.2020.0760